On linear recurrence sequences with polynomial coefficients

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Nearly Linear Recurrence Sequences

A nearly linear recurrence sequence (nlrs) is a complex sequence (an) with the property that there exist complex numbers A0,. . ., Ad−1 such that the sequence ( an+d + Ad−1an+d−1 + · · · + A0an )∞ n=0 is bounded. We give an asymptotic Binet-type formula for such sequences. We compare (an) with a natural linear recurrence sequence (lrs) (ãn) associated with it and prove under certain assumptions...

متن کامل

Exact linear modeling with polynomial coefficients

Given a finite set of polynomial, multivariate, and vector-valued functions, we show that their span can be written as the solution set of a linear system of partial differential equations (PDE) with polynomial coefficients. We present two different but equivalent ways to construct a PDE system whose solution set is precisely the span of the given trajectories. One is based on commutative algeb...

متن کامل

On the multiplicity of linear recurrence sequences

We prove a lemma regarding the linear independence of certain vectors and use it to improve on a bound due to Schmidt on the zero-multiplicity of linear recurrence sequences. 1 Linear recurrence sequences Let {un}n∈Z be a linear recurrence sequence of complex numbers satisfying the recurrence relation un = c1un−1 + · · ·+ ctun−t, (1) for c1, . . . , ct ∈ C with ct 6= 0. We say it is of order t ...

متن کامل

Efficiently determining Convergence in Polynomial Recurrence Sequences

­ We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity. The basic idea of our approach is to construct a univariate polynomial equation in x, whose coefficients correspond to the terms of the Sequence. The approa...

متن کامل

Palindromes in Linear Recurrence Sequences

We prove that for any base b ≥ 2 and for any linear homogeneous recurrence sequence {an}n≥1 satisfying certain conditions, there exits a positive constant c > 0 such that #{n ≤ x : an is palindromic in base b} x1−c.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Glasgow Mathematical Journal

سال: 1996

ISSN: 0017-0895,1469-509X

DOI: 10.1017/s0017089500031372